/*
 * @lc app=leetcode.cn id=674 lang=golang
 *
 * [674] 最长连续递增序列
 */

// @lc code=start
func findLengthOfLCIS(nums []int) int {
	i, j := 0, 1
	maxLength := 0
	for ; j < len(nums); j++ {
		if nums[j] <= nums[j-1] {
			maxLength = max(maxLength, j-i)
			i = j
		}
	}

	return max(maxLength, len(nums)-i)
}

// @lc code=end

